Non-monotonic Hopfield Networks

نویسنده

  • Jun-ichi Inoue
چکیده

We investigate the retrieval phase diagrams of an asynchronous fully-connected attractor network with non-monotonic transfer function by means of a mean-field approximation. We find for the noiseless zero-temperature case that this non-monotonic Hopfield network can store more patterns than a network with monotonic transfer function investigated by Amit et al. Properties of retrieval phase diagrams of non-monotonic networks agree with the results obtained by Nishimori and Opris who treated synchronous networks. We also investigate the optimal storage capacity of the non-monotonic Hopfield model with state-dependent synaptic couplings introduced by Zertuche et al. We show that the non-monotonic Hopfield model with state-dependent synapses stores more patterns than the conventional Hopfield model. Our formulation can be easily extended to a general transfer function.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Propositional Non-Monotonic Reasoning and Inconsistency in Symmetric Neural Networks

We define a notion of reasoning using world-rank-functions, independently of any symbolic language. We then show that every symmetric neural network (like Hopfield networks or Boltzman machines) can be seen as performing a search for a satisfying model of some knowledge that is wired into the network's topology and weights. Several equivalent languages are then shown to describe symbolically th...

متن کامل

Nonmonotonic Inferences and Neural Networks

There is a gap between two different modes of computation: the symbolic mode and the subsymbolic (neuron-like) mode. The aim of this paper is to overcome this gap by viewing symbolism as a high-level description of the properties of (a class of) neural networks. Combining methods of algebraic semantics and nonmonotonic logic, the possibility of integrating both modes of viewing cognition is dem...

متن کامل

Representation and Learning of Propositional Knowledge in Symmetric Connectionist Networks

The goal of this article is to construct a connectionist inference engine that is capable of representing and learning nonmotonic knowledge. An extended version of propositional calculus is developed and is demonstrated to be useful for nonmonotonic reasoning and for coping with inconsistency that may be a result of noisy, unreliable sources of knowledge. Formulas of the extended calculus (call...

متن کامل

Stochastic Hopfield Networks with Multiplicative Noise and Jump Markov Parameters

A non symmetric version of Hopfield networks subject to state-multiplicative noise, pure time delay and Markov jumps is considered. Such networks seem to arise in the context of visuo-motor control loops and may, therefore, be used to mimic their complex behaviour. In this paper, we adopt the Lur’e-Postnikov systems approach to analyze the stochastic stability and the L2 gain of generalized Hop...

متن کامل

Alternative Dynamic Network Structures for Non-linear System Modelling- Camera ready

Hopfield Neural Networks have been used as universal identifiers of non-linear systems, because of their inherent dynamic properties. However the design decision of the number of neurons in the Hopfield network is not easy to make, in order for the network model to have the necessary complexity, extra neurons are required. This poses a problem since the role of the states that these neurons rep...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996